What Is A Linear Data Structure?
Linear
means
straight
line.
A linear data structure is a structure that is
sequential.
Contrast this with a tree structure (which we'll study later) which is not a straight line.
Examples
The Structure
We see the data organized in a linear way here. A linear structure has a first (or start) and last (or end) element.
Walking The Structure
A key operation is walking along or
"traversing"
the structure.
Types Of Linear Structures
There are three primary types of concrete linear data structures:
Fixed Array
Dynamic Array
Linked List
A fixed array means it has a fixed structure. In other words, we cannot change the
structure
(no adding or removing).
The latter two types do
yes
support structure changes (adding and removing).
Navigation
Next Chapter
Examples
Data Structures And Algorithms (DSA) (Chapter 301 - Linear Data Structure)
Linear Data Structure
> CHAP302
Chapter
Examples
Top
Search Site
TOC